Knapsack problem - PDFSEARCH.IO - Document Search Engine

Knapsack problem
Results: 111

#	Item
91	Permuted Function Matching Rapha¨el Clifforda , Benjamin Sach∗,a a Department of Computer Science, University of Bristol,UK Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:18 Combinatorial optimization Dynamic programming Combinatorics Operations research Knapsack problem Matching Permutation Pattern matching Time complexity Theoretical computer science Computational complexity theory Applied mathematics
92	15-854: Approximations Algorithms Topic: Dynamic Programming Scribe: Mihir Kedia Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2005-10-28 08:20:42 Complexity classes Mathematical optimization Operations research NP-complete problems Strongly NP-complete Polynomial-time approximation scheme Job shop scheduling Knapsack problem Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
93	Part II Approximation Algorithms Add to Reading List Source URL: www2.informatik.hu-berlin.de Language: English - Date: 2011-02-08 14:10:43 Operations research Mathematical optimization Combinatorial optimization NP-complete problems Knapsack problem Polynomial-time approximation scheme Dynamic programming Approximation algorithm Algorithm Theoretical computer science Computational complexity theory Applied mathematics
94	CS 598CSC: Approximation Algorithms Instructor: Chandra Chekuri Add to Reading List Source URL: courses.engr.illinois.edu Language: English - Date: 2009-02-06 16:43:24 Operations research NP-complete problems Combinatorial optimization Dynamic programming Knapsack problem Bin packing problem Polynomial-time approximation scheme Approximation algorithm Linear programming relaxation Theoretical computer science Computational complexity theory Applied mathematics
95	Coping With NP-Hardness Approximation Algorithms Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2001-05-07 12:05:44 Operations research NP-complete problems Combinatorial optimization Approximation algorithms Travelling salesman problem Christofides algorithm Polynomial-time approximation scheme Optimization problem Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics
96	The Rise and Fall of Knapsack Cryptosystems A. M. Odlyzko AT&T Bell Laboratories Add to Reading List Source URL: www.dtc.umn.edu Language: English - Date: 1998-04-13 22:11:38 Public-key cryptography Dynamic programming Cryptography Combinatorial optimization Mathematical optimization Merkle–Hellman knapsack cryptosystem Knapsack problem P versus NP problem Subset sum problem Theoretical computer science Computational complexity theory Applied mathematics
97	Kobe University Repository : Kernel Add to Reading List Source URL: www.lib.kobe-u.ac.jp Language: English Merkle–Hellman knapsack cryptosystem Knapsack problem Rabin cryptosystem Cryptography Public-key cryptography Lenstra–Lenstra–Lovász lattice basis reduction algorithm
98	Dynamic Programming vs. Divide-&-conquer • Add to Reading List Source URL: users.cis.fiu.edu Language: English - Date: 2007-11-01 16:16:04 Dynamic programming Operations research NP-complete problems Combinatorial optimization Mathematical optimization Knapsack problem Greedy algorithm Algorithm Overlapping subproblems Mathematics Applied mathematics Theoretical computer science
99	A knapsack-type public key cryptosystem based on arithmetic in finite fields - Information Theory, IEEE Transactions on Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2013-06-02 16:23:31 Public-key cryptography Finite fields XTR Knapsack problem Merkle–Hellman knapsack cryptosystem Vector space Lattice problem NTRUEncrypt Three-pass protocol Mathematics Algebra Cryptography